Computing a partial generalized real Schur form using the Jacobi-Davidson method
نویسندگان
چکیده
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designed for real unsymmetric matrix pencils. Whenever a pencil has a complex conjugated pair of eigenvalues, the method computes the two dimensional real invariant subspace spanned by the two corresponding complex conjugated eigenvectors. This is beneficial for memory costs and in many cases it also accelerates the convergence of the JD method. In numerical experiments, the RJDQZ variant is compared with the original JDQZ method.
منابع مشابه
Locking and Restarting Quadratic Eigenvalue Solvers
This paper studies the solution of quadratic eigenvalue problems by the quadratic residual iteration method. The focus is on applications arising from nite-element simulations in acoustics. One approach is the shift-invert Arnoldi method applied to the linearized problem. When more than one eigenvalue is wanted, it is advisable to use locking or de-ation of converged eigenvectors (or Schur vect...
متن کاملJacobi - Davidson style QR and QZ algorithmsfor the partial reduction of matrix pencilsbyDiederik
The Jacobi-Davidson subspace iteration method ooers possibilities for solving a variety of eigen-problems. In practice one has to apply restarts because of memory limitations, in order to restrict computational overhead, and also if one wants to compute several eigenvalues. In general, restarting has negative eeects on the convergence of subspace methods. We will show how eeective restarts can ...
متن کاملJacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
Recently the Jacobi–Davidson subspace iteration method has been introduced as a new powerful technique for solving a variety of eigenproblems. In this paper we will further exploit this method and enhance it with several techniques so that practical and accurate algorithms are obtained. We will present two algorithms, JDQZ for the generalized eigenproblem and JDQR for the standard eigenproblem,...
متن کاملJacobi - Davidson Style Qr and Qz Algorithms for Thereduction of Matrix Pencilsdiederik
Recently the Jacobi-Davidson subspace iteration method has been introduced as a new powerful technique for solving a variety of eigenproblems. In this paper we will further exploit this method and enhance it with several techniques so that practical and accurate algorithms are obtained. We will present two algorithms, JDQZ for the generalized eigenproblem, and JDQR for the standard eigenproblem...
متن کاملA Jacobi-like algorithm for computing the generalized Schur form of a regular pencil
We develop a Jacobi-like scheme for computing the generalized Schur form of a regular pencil of matrices h B A. The method starts with a preliminary triangularization of the matrix B and iteratively reduces A to triangular form, while maintaining B triangular. The scheme heavily relies on the technique of Stewart for computing the Schur form of an arbitrary matrix A. Just as Stewart’s algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007